Lambek Calculus: Recognizing Power and Complexity
نویسنده
چکیده
I survey known results and results that easily follow from known results about the recognizing power and complexity of various fragments of the Lambek calculus.
منابع مشابه
On the Recognizing Power of the Lambek Calculus with Brackets
Every language recognized by the Lambek calculus with brackets is context-free. This is shown by combining an observation by Jäger with an entirely straightforward adaptation of the method Pentus used for the original Lambek calculus. The case of the variant of the calculus allowing sequents with empty antecedents is slightly more complicated, requiring a restricted use of the multiplicative unit.
متن کاملA Note on the Complexity of Associative-Commutative Lambek Calculus
In this paper the NP-completeness of the system LP (associative-commutative Lambek calculus) will be shown. The complexity of LP has been known for some time, it is a corollary of a result for multiplicative intuitionistic linear logic (MILL)1 from (Kanovich, 1991) and (Kanovich, 1992). We show that this result can be strengthened: LP remains NP-complete under certain restrictions. The proof do...
متن کاملProof nets for the Lambek calculus — an overview
There are both linguistic and mathematical reasons for studying proof nets the perspective of categorial grammar. It is now well known that the Lambek calculus corresponds to intuitionnistic non-commutative multiplicative linear logic — with no empty antecedent, to be absolutely precise. As natural deduction underlines the constructive contents of intuitionistic logic (Curry-Howard isomorphism)...
متن کاملEfficient Parsing with the Product-Free Lambek Calculus
This paper provides a parsing algorithm for the Lambek calculus which is polynomial time for a more general fragment of the Lambek calculus than any previously known algorithm. The algorithm runs in worst-case time O(n5) when restricted to a certain fragment of the Lambek calculus which is motivated by empirical analysis. In addition, a set of parameterized inputs are given, showing why the alg...
متن کاملEfficiently Parsing with the Product-Free Lambek Calculus
This paper provides a parsing algorithm for the Lambek calculus which is polynomial time for a more general fragment of the Lambek calculus than any previously known algorithm. The algorithm runs in worst-case time O(n5) when restricted to a certain fragment of the Lambek calculus which is motivated by empirical analysis. In addition, a set of parameterized inputs are given, showing why the alg...
متن کامل